Gröbner bases for polynomial systems with parameters

نویسندگان

  • Antonio Montes
  • Michael Wibmer
چکیده

Gröbner bases are the computational method par excellence for studying polynomial systems. In the case of parametric polynomial systems one has to determine the reduced Gröbner basis in dependence of the values of the parameters. In this article, we present the algorithm GröbnerCover which has as inputs a finite set of parametric polynomials, and outputs a finite partition of the parameter space into locally closed subsets together with polynomial data, fromwhich the reduced Gröbner basis for a given parameter point can immediately be determined. The partition of the parameter space is intrinsic and particularly simple if the system is homogeneous. © 2010 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gröbner Bases and Systems Theory

We present the basic concepts and results of Gröbner bases theory for readers working or interested in systems theory. The concepts and methods of Gröbner bases theory are presented by examples. No prerequisites, except some notions of elementary mathematics, are necessary for reading this paper. The two main properties of Gröbner bases, the elimination property and the linear independence prop...

متن کامل

An efficient method for computing comprehensive Gröbner bases

a r t i c l e i n f o a b s t r a c t A new approach is proposed for computing a comprehensive Gröb-ner basis of a parameterized polynomial system. The key new idea is not to simplify a polynomial under various specialization of its parameters, but rather keep track in the polynomial, of the power products whose coefficients vanish; this is achieved by partitioning the polynomial into two parts...

متن کامل

Generalized Discrete Comprehensive Gröbner Bases

We showed special types of comprehensive Gröbner bases can be defined and calculated as the applications of Gröbner bases in polynomial rings over commutative Von Neumann regular rings in [5] and [6]. We called them discrete comprehensive Gröbner bases, since there is a strict restriction on specialization of parameters, that is parameters can take values only 0 and 1. In this paper, we show th...

متن کامل

Normal form methods in statistical signal processing

Workshop on Gröbner Bases in Control Theory and Signal Processing May 18 19, 2006 Linz, Austria Special Semester on Gröbner bases and Related Methods 2006 Chairman: Hyungju Park • Hirokazu Anai, Sum of roots with positive real part in system and control theory • N.K. Bose, Two decades (1985-2005) of Gröbner bases in multidimensional systems • Jerome Lebrun, Normal form methods in statistical si...

متن کامل

Using Gröbner Bases to Investigate Flag Algebras and Association Scheme Fusion

It is instructive to see how the use of Gröbner bases [2] can clarify certain computational and theoretic aspects of various topics. Here the choice of topics come from association schemes and fusion of flag algebras arising from generalized n-gons and 2-(v, k, 1) designs [6]. Three different ways of using concepts related to Gröbner bases are given as a guide for using such concepts in similar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2010